Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition

We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as a composition of conditional risk measures. We analyze properties of the problem and derive necessary and sufficient optimality conditions. Next, we construct two decomposition methods for solving the problem. The firs...

متن کامل

Scenario decomposition of risk-averse multistage stochastic programming problems

We briefly discuss some history on the development of risk-averse optimization leading into coherent risk measures. For a riskaverse multistage stochastic optimization problem with a finite scenario tree, we introduce a new scenario decomposition method and prove its convergence. We then show how to apply our method to a typical operations management inventory and assembly problem. BIOGRAPHY Dr...

متن کامل

Multilevel Optimization Modeling for Risk-Averse Stochastic Programming

Coherent risk measures have become a popular tool for incorporating risk aversion into stochastic optimization models. For dynamic models in which uncertainty is resolved at more than one stage, however, using coherent risk measures within a standard single-level optimization framework becomes problematic. To avoid severe time-consistency difficulties, the current state of the art is to employ ...

متن کامل

Two Stage Stochastic Linear Programming with Gams

This document shows how to model two-stage stochastic linear programming problems in a GAMS environment. We will demonstrate using a small example, how GAMS can be used to formulate and solve this model as a large LP or using specialized stochastic solvers such as OSL-SE and DECIS. Finally a tailored implementation of the Benders Decomposition algorithm written in GAMS is used to solve the model.

متن کامل

Minimax and risk averse multistage stochastic programming

In this paper we study relations between the minimax, risk averse and nested formulations of multistage stochastic programming problems. In particular, we discuss conditions for time consistency of such formulations of stochastic problems. We also describe a connection between law invariant coherent risk measures and the corresponding sets of probability measures in their dual representation. F...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2011

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.1100.0847